Strongly Ergodic Sequences of Integers and the Individual Ergodic Theorem
نویسندگان
چکیده
منابع مشابه
Strongly Ergodic Sequences of Integers and the Individual Ergodic Theorem
Let S = {ki,ki, ...} be an increasing sequence of positive integers. We call S strongly ergodic if for every measure preserving transformation T on a probability space (Cl, J, P) and every / £ Li(f2) we have limn-»oo(l/n) J^^j f(TkiuJ) = Pf(w) a.e. where Pf is the appropriate limit guaranteed by the individual ergodic theorem. We give sufficient conditions for a sequence S to be strongly ergodi...
متن کاملThe Converse of the Individual Ergodic Theorem
converge almost everywhere to a finite limit f*(x). It then follows that the limit function/* is integrable and that/*(7x) =/*(x) almost everywhere. This result can be applied to certain cases in which the given measure m is not preserved by the transformation T. In order to discuss this application, we recall some terminology for measures and transformations. If (X, S) is a measurable space, a...
متن کاملErgodic theorem, ergodic theory, and statistical mechanics.
This perspective highlights the mean ergodic theorem established by John von Neumann and the pointwise ergodic theorem established by George Birkhoff, proofs of which were published nearly simultaneously in PNAS in 1931 and 1932. These theorems were of great significance both in mathematics and in statistical mechanics. In statistical mechanics they provided a key insight into a 60-y-old fundam...
متن کاملIndividual ergodic theorem for intuitionistic fuzzy observables using intuitionistic fuzzy state
The classical ergodic theory hasbeen built on σ-algebras. Later the Individual ergodictheorem was studied on more general structures like MV-algebrasand quantum structures. The aim of this paper is to formulate theIndividual ergodic theorem for intuitionistic fuzzy observablesusing m-almost everywhere convergence, where m...
متن کاملKingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem
A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1982
ISSN: 0002-9939
DOI: 10.2307/2043590